A greedy double swap heuristic for nurse scheduling

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Greedy Double Swap Heuristic for Nurse Scheduling

Article history: Received April 17, 2012 Accepted 11 June 2012 Available online June 14 2012 One of the key challenges of nurse scheduling problem (NSP) is the number of constraints placed on preparing the timetable, both from the regulatory requirements as well as the patients’ demand for the appropriate nursing care specialists. In addition, the preferences of the nursing staffs related to th...

متن کامل

A Heuristic Greedy Algorithm for Scheduling Out-Tree Task Graphs

The scheduling of Out-Tree task graphs is one of the critical factors in implementing the compilers of parallel languages and improving the performance of parallel computing. Although there are a few heterogeneity based algorithms in the literature suitable for scheduling Out-Tree task graphs, they usually require significantly high scheduling costs and may not deliver good quality schedules wi...

متن کامل

Maximizing the nurses’ preferences in nurse scheduling problem: mathematical modeling and a meta-heuristic algorithm

The nurse scheduling problem (NSP) has received a great amount of attention in recent years. In the NSP, the goal is to assign shifts to the nurses in order to satisfy the hospital’s demand during the planning horizon by considering different objective functions. In this research, we focus on maximizing the nurses’ preferences for working shifts and weekends off by considering several important...

متن کامل

An electromagnetic meta-heuristic for the nurse scheduling problem

In this paper, we present a novel meta-heuristic technique for the nurse scheduling problem (NSP). This well-known scheduling problem assigns nurses to shifts per day taking both hard and soft constraints into account. The objective is to maximize the preferences of the nurses and to minimize the total penalty cost from violations of the soft constraints. The problem is known to be NP-hard. Due...

متن کامل

A hybrid heuristic approach of nurse scheduling problem

Purpose -Nurse scheduling problem is a key issue in strategic management in healthcare institutes. To improve the current manual-made nurse schedule, this paper presents a hybrid heuristic approach to generate weekly nurse schedule for a local Emergency Department (ED) in Hong Kong. Design/methodology/approach -A two-stage method is developed for the above purpose. In the first stage, approve-i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Management Science Letters

سال: 2012

ISSN: 1923-9335,1923-9343

DOI: 10.5267/j.msl.2012.06.021